Efficient Query Refinement for View Recommendation in Visual Data Exploration

A survey of query recommendation techniques for data warehouse exploration

Lots of data are gathered in datawarehouses that are navigated and explored for analytical purposes. Only recently has the problem of recommending a datawarehouse query to a datawarehouse user attracted attention. In this paper, we propose a simple formal framework for expressing datawarehouse query recommendations. We propose to see the problem of recommending a datawarehouse query for explora...

Using Metadata for Query Refinement and Recommendation

Discovering Popular Clicks\' Pattern of Teen Users for Query Recommendation

Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...

An Efficient Query Structure for Mesh Refinement

We are interested in the following mesh refinement problem: given an input set of points P in R, we would like to produce a good-quality triangulation by adding new points in P . Algorithms for mesh refinement are typically incremental; they compute the Delaunay triangulation of the input, then insert points one by one. However, retriangulating after each insertion can take linear time. In this...

Efficient Query Refinement in Multimedia Databases

Large repositories of multimedia objects containing digital images, video, audio and text documents are becoming common. There is an increasing application need to search these repositories based on their content. Examples include online shopping (e.g., “Find me all shirts that look like this one), medical applications (e.g., “Find all tumors similar to a given pattern”), face recognition, trad...